Permutational genetic algorithm for fixed priority scheduling of distributed real-time systems aided by network segmentation

The fixed priority scheduling of distributed realtime systems is an NP-hard problem, and therefore it is a suitable problem to be approached with generic search and optimization algorithms. On the other hand, the segmentation of the network can contribute positively to the schedulability of distributed real-time systems. This paper proposes a genetic algorithm with a permutational solution encoding that solves the holistic assignment of fixed priorities in distributed realtime systems aided by the optimized segmentation of the network. Keywords-distributed; real-time; holistic scheduling; priority; CAN segmentation; permutational genetic algorithm